CD Simplicity

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simplicity.

Perhaps the most famous equation in science is E = mc2; it also represents one of the best-known scientific insights. But why does Einstein’s equation about the conservation of energy enjoy such popularity? Is it because it is easily and instinctively understood, or because it is widely taught in schools? I doubt that either explanation is true; rather, its appeal is its elegant simplicity with...

متن کامل

Simplicity simplified

We expose the foundations of simple theories in a straightforward way including many improved proofs which can only be found scattered in the specialized literature. We start with general model theory and finish with the proof of the independence theorem.

متن کامل

Simplicity, personhood, and divinity

In contemporary philosophy of religion, it is customary to think of God as an individual person, who exists in time, and is related to things in the world not only as their cause but also in various respects as their effect.1 On the whole, this model has displaced the so-called 'classical' account, according to which God is pure being and therefore 'simple'. Two kinds of consideration lie behin...

متن کامل

Reality as simplicity

We discuss some fundamental aspects of information theory and its relationship to physics and neuroscience. The aim is to identify some questions and point out the relevance of the concept of Kolmogovov complexity in their eventual resolution. The discussion is based on two premises: 1) all human experience is generated in the brain, 2) all the brain has access to is information. Taken together...

متن کامل

Simplicity and Strong Reductions

A set is called NP-simple if it lies in NP, and its complement is infinite, and does not contain any infinite subsets in NP. Hartmanis, Li and Yesha [HLY86] proved that no set which is hard for NP under many-one (Karp) reductions is NP-simple unless NP ∩ coNP ⊆ SUBEXP. However, we can exhibit a relativized world in which there is an NP-simple set that is complete under Turing (Cook) reductions,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Analytical Chemistry

سال: 2003

ISSN: 0003-2700,1520-6882

DOI: 10.1021/ac031357z